Ricci-flat cubic graphs with girth five
نویسندگان
چکیده
We classify all connected, simple, 3-regular graphs with girth at least 5 that are Ricci-flat. use the definition of Ricci curvature on given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation Ollivier, J. Funct. Anal., 2009. A graph Ricci-flat, if it has vanishing edges. show, only Ricci-flat cubic Petersen graph, Triplex and dodecahedral graph. This will correct classification Comm. Anal. Geom., 2014, misses Triplex.
منابع مشابه
Constructions for Cubic Graphs with Large Girth
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer μ0(g), the smallest number of vertices for which a cubic graph with girth at least g exists, and furthermore, the minimum value μ0(g) is attained by a graph whose girth is exactly g. The values of μ0(g) when 3 ≤ g ≤ 8 have been known for over thirty y...
متن کاملSymmetric cubic graphs of small girth
A graph Γ is symmetric if its automorphism group acts transitively on the arcs of Γ, and s-regular if its automorphism group acts regularly on the set of s-arcs of Γ. Tutte (1947, 1959) showed that every cubic finite symmetric cubic graph is s-regular for some s ≤ 5. We show that a symmetric cubic graph of girth at most 9 is either 1-regular or 2-regular (following the notation of Djokovic), or...
متن کاملDomination in Cubic Graphs of Large Girth
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n+O ( n g ) .
متن کاملGirth six cubic graphs have Petersen minors
We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph. 3 January 1997 Revised 17 March 2014 ∗ Research partially performed under a consulting agreement with Bellcore, and partially supported by DIMACS Center, Rutgers University, New Brunswick, New Jersey 08903, USA. 1 Partially supported by NSF under Grant No...
متن کاملThe Smallest Cubic Graphs of Girth Nine
We describe two computational methods for the construction of cubic graphs with given girth. These were used to produce two independent proofs that the (3, 9)-cages, defined as the smallest cubic graphs of girth 9, have 58 vertices. There are exactly 18 such graphs. We also show that cubic graphs of girth 11 must have at least 106 vertices and cubic graphs of girth 13 must have at least 196 ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Analysis and Geometry
سال: 2021
ISSN: ['1019-8385', '1944-9992']
DOI: https://doi.org/10.4310/cag.2021.v29.n7.a3